Banach spaces with the “scalar-plus-compact” and “invariant subspace” properties. Spiros Argyros (NTUA) We will discuss two structural properties of the space of boundedlinear operators L(X) of a Banach space X.

Source URL: www.7ecm.de

• Mathematical analysis
• Mathematics
• Operator theory
• Functional analysis
• Invariant subspace problem
• Invariant subspace
• Reflexive space
• Banach space
• Per Enflo
• Compact operator
• Tsirelson space
• Approximation property

On the Computational Complexity of MapReduce ´ am D. Lelkes1 , Lev Reyzin1 , Benjamin Fish1 , Jeremy Kun1(B) , Ad´ and Gy¨ orgy Tur´

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Computational resources
• Structural complexity theory
• Theoretical computer science
• MapReduce
• Time hierarchy theorem
• NTIME
• Time complexity
• DSPACE
• SL

1 Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

Source URL: dept.stat.lsa.umich.edu

• Graph theory
• Mathematics
• Matroid theory
• Matching
• Combinatorial optimization
• Bipartite graph
• Maximum flow problem
• Degree
• Connectivity
• Ear decomposition
• HopcroftKarp algorithm
• Expander graph

Establishing the Frame of Reference for the Developmental Trajectory of Structural Connectivity based on Graph Theory and HARDI/DTI Yuan W, PhD1,3, Rajagopal A, MS1; Lee G, PhD1,3, Vannest J, PhD1,2,3, Holland S, PhD1,3,

Source URL: www.pacificrimneuroimaging.net

Static Typing & JavaScript Libraries: ∗ Towards a More Considerate Relationship Benjamin Canou Emmanuel Chailloux

Source URL: www2013.wwwconference.org

• Type theory
• Object-oriented programming
• Data types
• Functional programming
• OCaml
• Structural type system
• Ocsigen
• Type system
• Duck typing
• Immutable object
• Caml
• Constant

Protein Structure Alignment Using a Graph Matching Technique Tatsuya Akutsu Department of Computer Science, Gunma University

Source URL: www.jsbi.org

• Bioinformatics
• Mathematics
• Statistics
• Computational phylogenetics
• Graph theory
• Root-mean-square deviation of atomic positions
• Dynamic programming
• Matching
• Bipartite graph
• Root-mean-square deviation
• Algorithm
• Structural alignment software

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

212C: Symbolic Interactionism and Post-Structural Social Theory M 9:00-12:00 Laurel Heights Prof. Catherine Bliss Office: SBS 455

Source URL: www.catherinebliss.com

CLASE 2005 Preliminary Version Constructing Induction Rules for Deductive Synthesis Proofs Alan Bundy† 1,2 Lucas Dixon† 3 Jeremy Gow‡ 4 Jacques Fleuriot† 5

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Mathematical logic
• Theoretical computer science
• Computability theory
• Theory of computation
• Recursion
• Type theory
• Structural induction
• Mathematical induction
• Rippling
• Nqthm
• Constructible universe